An Adaptive Neighborhood Graph for LLE Algorithm without Free-Parameter
نویسندگان
چکیده
منابع مشابه
An Adaptive Neighborhood Graph for LLE Algorithm without Free-Parameter
Locally Linear Embedding (LLE) algorithm is the first classic nonlinear manifold learning algorithm based on the local structure information about the data set, which aims at finding the low-dimension intrinsic structure lie in high dimensional data space for the purpose of dimensionality reduction. One deficiency appeared in this algorithm is that it requires users to give a free parameter k w...
متن کاملAdaptive Neighborhood Graph for LTSA Learning Algorithm without Free-Parameter
Local Tangent Space Alignment (LTSA) algorithm is a classic local nonlinear manifold learning algorithm based on the information about local neighborhood space, i.e., local tangent space with respect to each point in dataset, which aims at finding the low-dimension intrinsic structure lie in high dimensional data space for the purpose of dimensionality reduction. In this paper, we present a nov...
متن کاملLLE with low-dimensional neighborhood representation
The local linear embedding algorithm (LLE) is a non-linear dimension-reducing technique, widely used due to its computational simplicity and intuitive approach. LLE first linearly reconstructs each input point from its nearest neighbors and then preserves these neighborhood relations in the low-dimensional embedding. We show that the reconstruction weights computed by LLE capture the high-dimen...
متن کاملAn improved neighborhood algorithm: parameter conditions and dynamic scaling
The Neighborhood Algorithm (NA) is a popular direct search inversion technique. For dispersion curve inversion, physical conditions between parameters Vs and Vp (linked by Poisson’s ratio) may limit the parameter space with complex boundaries. Other conditions may come from prior information about the geological structure. Irregular limits are not natively handled by classical search algorithms...
متن کاملAdaptive Regularization Parameter for Graph Cut Segmentation
Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulation through a regularization parameter. We propose that the trade-off between the data and the smoothness terms should not be balanced by the same regularization parameter for the whole image. In order to validate the proposed id...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/1984-2673